Polynomial time cryptanalysis of noncommutative-algebraic key exchange protocols
نویسنده
چکیده
We introduce the linear centralizer method for a passive adversary to extract the shared key in group-theory based key exchange protocols (KEPs). We apply this method to obtain a polynomial time cryptanalysis of the Commutator KEP, introduced by Anshel–Anshel–Goldfeld in 1999 and considered extensively ever since. We also apply this method to the Centralizer KEP, introduced by Shpilrain–Ushakov in 2006. Our method is proved to be of polynomial time using a technical lemma about sampling invertible matrices from a linear space of matrices.
منابع مشابه
Cryptanalysis via algebraic spans
We introduce a method for obtaining provable polynomial time solutions of problems in nonabelian algebraic cryptography. This method is widely applicable, easier to apply, and more efficient than earlier methods. After demonstrating its applicability to the major classic nonabelian protocols, we use this method to cryptanalyze the Triple Decomposition key exchange protocol, the only classic gro...
متن کاملCryptanalysis of a noncommutative key exchange protocol
In the papers by Alvarez et al. and Pathak and Sanghi a noncommutative based public key exchange is described. A similiar version of it has also been patented (US7184551). In this paper we present a polynomial time attack that breaks the variants of the protocol presented in the two papers. Moreover we show that breaking the patented cryptosystem US7184551 can be easily reduced to factoring. We...
متن کاملKey exchange protocols over noncommutative rings. The case of
In this paper we introduce some key exchange protocols over noncommutative rings. These protocols use some polynomials with coefficients in the center of the ring as part of the private keys. We give some examples over the ring End(Zp × Zp2), where p is a prime number. We also give a security analysis of the proposed protocols and conclude that the only possible attack is by brute force.
متن کاملThe implementation of cubic public keys based on a new family of algebraic graphs
Families of edge transitive algebraic graphs defined over finite commutative rings were used for the development of stream ciphers, public key cryptosystems and key exchange protocols. We present the results of the first implementation of a public key algorithm based on the family of algebraic graphs, which are not edge transitive. The absence of an edge transitive group of symmetries means tha...
متن کاملKey agreement protocols for distributed secure multicast over the ring
Protocols for authenticated key exchange allow parties within an insecure network to establish a common session key which can then be used to secure their future communication. In this paper we introduce a protocol for distributed key agreement over a noncommutative ring with a large number of noninvertible elements. This protocol uses polynomials with coefficients in the center of the ring. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2012 شماره
صفحات -
تاریخ انتشار 2012